Performance comparisons of current metaheuristic algorithms on unconstrained optimization problems
نویسندگان
چکیده
منابع مشابه
Problems of Unconstrained Optimization
In this paper we give an review on convergence problems of un-constrained optimization algorithms, including line search algorithms and trust region algorithms. Recent results on convergence of conjugate gradient methods are discussed. Some well-known convergence problems of variable metric methods and recent eeorts made on these problems are also presented.
متن کاملParticle Swarm Optimization Performance for Unconstrained Optimization Problems
Particle swarm Optimization (PSO) is mainly inspired by social behavior patterns of organisms that live and interact within large groups. The term PSO refers to a relatively new family of algorithms that is used to find optimal or near to optimal solutions to numerical and qualitative problems. It is an optimization paradigm that simulates the ability of human to process knowledge. The capabili...
متن کاملComparative Study of Bio-inspired algorithms for Unconstrained Optimization Problems
Nature inspired meta-heuristic algorithms are iterative search processes which find near optimal solutions by efficiently performing exploration and exploitation of the solution space. Considering the solution space in a specified region, this work compares performances of Bat, Cuckoo search and Firefly algorithms for unconstrained optimization problems. Global optima are found using various te...
متن کاملThe Algorithms of Broyden-CG for Unconstrained Optimization Problems
The conjugate gradient method plays an important role in solving large-scaled problems and the quasi-Newton method is known as the most efficient method in solving unconstrained optimization problems. Therefore, in this paper, the new hybrid 2592 Mohd Asrul Hery Ibrahim et al. method between the conjugate gradient method and the quasi-newton method for solving optimization problem is suggested....
متن کاملParameter Meta-optimization of Metaheuristic Optimization Algorithms
Erklärung Hiermit erkläre ich an Eides statt, dass ich die vorliegende Arbeit selbstständig und ohne fremde Hilfe verfasst, andere als die angegebenen Quellen und Hilfsmit-tel nicht benutzt und die aus anderen Quellen entnommenen Stellen als solche gekennzeichnet habe. Abstract 1 Kurzfassung 2 1 Introduction 3 1.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Periodicals of Engineering and Natural Sciences (PEN)
سال: 2017
ISSN: 2303-4521
DOI: 10.21533/pen.v5i3.120